Feature hallucination in hypersphere space for few‐shot classification

نویسندگان

چکیده

Few-shot classification (FSC) targeting at classifying unseen classes with few labelled samples is still a challenging task. Recent works show that transfer-learning based approaches are competitive meta-learning ones, which usually pre-train convolutional neural networks (CNN)-based network using cross-entropy (CE) loss and throw away the last layer to post-process novel classes. Hereby, they suffer issue of getting more transferable extractor lacking enough samples. Thus, authors propose algorithm feature hallucination in hypersphere space (FHHS) for FSC. On first stage, (HL), supplies CE supervised contrastive (SC) self-supervised (SSL), SC can map base images onto densely. second generate new their synthetic sampling (SNSB), linearly interpolate between each class prototype its K nearest neighbour prototypes. Comprehensive experiments on multiple popular FSC demonstrate HL enhance performance backbone authors’ method superior existing hallucination-based methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Space Mapping Network for Classification

The development of the Feature Space Mapping (FSM) system has been motivated by our conviction that neurodynamical models of the brain are very difficult, it is not clear how to model larger groups of neurons in a realistic way and simple neural networks are not well suited for cognitive modeling. Mind arises from a complex dynamics of the modular and hierarchical brain structures. Approximatio...

متن کامل

Nearest feature line embedding for face hallucination

A new manifold learning method, called nearest feature line (NFL) embedding, for face hallucination is proposed. While many manifold learning based face hallucination algorithms have been proposed in recent years, most of them apply the conventional nearest neighbour metric to derive the subspace and may not effectively characterise the geometrical information of the samples, especially when th...

متن کامل

Feature-Based Dissimilarity Space Classification

General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [1,2]. They often arise in problems in which direct comparisons of objects are made by computing pairwise distances between images, spectra, graphs or strings. Dissimilarity-based classifiers can also be defined in vector spaces [3]. A large comparative study has not been undertaken so far. This paper...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

An Improved Flower Pollination Algorithm with AdaBoost Algorithm for Feature Selection in Text Documents Classification

In recent years, production of text documents has seen an exponential growth, which is the reason why their proper classification seems necessary for better access. One of the main problems of classifying text documents is working in high-dimensional feature space. Feature Selection (FS) is one of the ways to reduce the number of text attributes. So, working with a great bulk of the feature spa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Iet Image Processing

سال: 2022

ISSN: ['1751-9659', '1751-9667']

DOI: https://doi.org/10.1049/ipr2.12579